منابع مشابه
Some new localization theorems on Hamiltonian properties
Let G be a 2-connected graph with n ?: 3 vertices such that for any two vertices u, v at distance two in an induced subgraph K 1,3 or P4 of G, the inequality d(u) + d(v) ?: IN(u) U N(v) U N(w)ls holds for all w E N(u) n N(v). We prove that (i) if s = 1 and IN(u) n N(v)1 ?: 2, then G is hamiltonian or K p,p+1 ~ G ~ Kp + K p+1; (ii) if s = 0, then G is either pancyclic, or bipartite graph. This g...
متن کاملSome localization theorems on hamiltonian circuits
The self-archived postprint version of this journal article is available at Linköping University Institutional Repository (DiVA): http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-143287 N.B.: When citing this work, cite the original publication. Hasratian, A. S, Khachatrian, N. K, (1990), Some localization theorems on hamiltonian circuits, Journal of combinatorial theory. Series B (Print), 49...
متن کاملElectromagnetic wormholes via handlebody constructions
Cloaking devices are prescriptions of electrostatic, optical or electromagnetic parameter fields (conductivity σ(x), index of refraction n(x), or electric permittivity ǫ(x) and magnetic permeability μ(x)) which are piecewise smooth on R3 and singular on a hypersurface Σ, and such that objects in the region enclosed by Σ are not detectable to external observation by waves. Here, we give related ...
متن کاملCortical Computation via Iterative Constructions
We study Boolean functions of an arbitrary number of input variables that can be realized by simple iterative constructions based on constant-size primitives. This restricted type of construction needs little global coordination or control and thus is a candidate for neurally feasible computation. Valiant’s construction of a majority function can be realized in this manner and, as we show, can ...
متن کاملConstructions of hamiltonian graphs with bounded degree and diameter
Token ring topology has been frequently used in the design of distributed loop computer networks and one measure of its performance is the diameter. We propose an algorithm for constructing hamiltonian graphs with n vertices and maximum degree ∆ and diameter O(log n), where n is an arbitrary number. The number of edges is asymptotically bounded by (2− 1 ∆−1 − (∆−2)2 (∆−1)3 )n. In particular, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2005
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.03.029